A Multi Population Genetic Algorithm for Hop-Constrained Trees in Nonlinear Cost Flow Networks1
نویسنده
چکیده
Genetic algorithms and other evolutionary algorithms have been successfully applied to solve constrained minimum spanning tree problems in a variety of communication network design problems. Here we propose a multi population genetic algorithm for yet another communication design problem. The new problem is modeled through a hop-constrained minimum spanning tree also exhibiting the characteristic of flows. In addition to the fixed charge costs, nonlinear flow dependent costs are also considered. This problem is an extension of the well know NP-hard hop-constrained Minimum Spanning Tree problem (HMST). The efficiency and effectiveness of the proposed method can be seen from the computational results reported.
منابع مشابه
A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
Genetic algorithms and other evolutionary algorithms have been successfully applied to solve constrained minimum spanning tree problems in a variety of communication network design problems. In this paper we enlarge the application of these types of algorithms by presenting a multi-population hybrid genetic algorithm to another communication design problem. This new problem is modeled through a...
متن کاملA Multi Population Genetic Algorithm for Hop-Constrained Trees in Nonlinear Cost Flow Networks∗
Genetic algorithms and other evolutionary algorithms have been successfully applied to solve constrained minimum spanning tree problems in a variety of communication network design problems. Here we propose a multi population genetic algorithm for yet another communication design problem. The new problem is modeled through a hop-constrained minimum spanning tree also exhibiting the characterist...
متن کاملA Multi-population Genetic Algorithm for Tree-shaped Network Design Problems
In this work we propose a multi-population genetic algorithm for tree-shaped network design problems using random keys. Recent literature on finding optimal spanning trees suggests the use of genetic algorithms. Furthermore, random keys encoding has been proved efficient at dealing with problems where the relative order of tasks is important. Here we propose to use random keys for encoding tree...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملThe hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
In this work we address the Hop-Constrained Minimum cost Flow Spanning Tree (HMFST) problem with nonlinear costs. The HMFST problem is an extension of the Hop-Constrained Minimum Spanning Tree problem since it considers flow requirements other than unit flows. We propose a hybrid heuristic, based on Ant Colony Optimization and on Local Search, to solve this class of problems given its combinato...
متن کامل